Further results on the enumeration of hamilton paths in Cayley digraphs on semidirect products of cyclic groups
نویسنده
چکیده
First, let m and n be positive integers such that n is odd and gcd(m, n) = 1. Let G be the semidirect product of cyclic groups given by G= Z8m Z2n = 〈x, y : x8m = 1, y2n = 1, and yxy−1 = x4m+1〉. Then the number of hamilton paths in Cay(G : x, y) (with initial vertex 1) is one fewer than the number of visible lattice points that lie on the closed quadrilateral whose vertices in consecutive order are (0, 0), (4mn2+ 2n, 16m2n), (n, 4m), and (0, 8m). Second, let m and n be positive integers such that n is odd. Let G be the semidirect product of cyclic groups given byG=Z4m Z2n=〈x, y : x4m= 1, y2n= 1, and yxy−1= x2m−1〉. Then the number of hamilton paths in Cay(G : x, y) (with initial vertex 1) is (3m− 1)n+m (n+ 1)/3 + 1. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Hamilton paths in Cayley diagraphs of metacyclic groups
Curran, S.J., Hamilton paths in Cayley digraphs of metacyclic groups, Discrete Mathematics 115 (1993) 133-139. We obtain a characterization of all Hamilton paths in the Cayley digraph of a metacyclic group G with generating set {x, y} where (yx-‘) a G. The abundance of these Hamilton paths allows us to show that Hamilton paths occur in groups of at least two.
متن کاملHamilton cycles and paths in vertex-transitive graphs - Current directions
In this article current directions in solving Lovász’s problem about the existence of Hamilton cycles and paths in connected vertex-transitive graphs are given. © 2009 Elsevier B.V. All rights reserved. 1. Historical motivation In 1969, Lovász [59] asked whether every finite connected vertex-transitive graph has a Hamilton path, that is, a simple path going through all vertices, thus tying toge...
متن کاملEnds for Monoids and Semigroups
We give a graph-theoretic definition for the number of ends of Cayley digraphs for finitely generated semigroups and monoids. For semigroups and monoids, left Cayley digraphs can be very different from right Cayley digraphs. In either case, the number of ends for the Cayley digraph does not depend upon which finite set of generators is used for the semigroup or monoid. For natural numbers m and...
متن کاملOn trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کاملSpectra of Semidirect Products of Cyclic Groups
The spectrum of a graph is the set of eigenvalues of its adjacency matrix. A group, together with a multiset of elements of the group, gives a Cayley graph, and a semidirect product provides a method of producing new groups. This paper compares the spectra of cyclic groups to those of their semidirect products, when the products exist. It was found that many of the interesting identities that r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008